Related Articles ( Optimization problems )
DHO conjugate gradient method for unconstrained optimization
In this paper, we suggest a new coefficient conjugate gradient method for nonlinear unconstrained optimization by using two parameters one of them is parameter of (FR) and the other one is parameter of (CD), we give a descent condition of the suggested method.
A new self-scaling variable metric (DFP) method for unconstrained optimization problems
In this study, a new self-scaling variable metric (VM)-updating method for solving nonlinear unconstrained optimization problems is presented. The general strategy of (New VM-updating) is to propose a new quasi-newton condition used for update the usual DFP Hessian to a number of times in a way to be ...
A New conjugate gradient method for unconstrained optimization problems with descent property
In this paper, we propose a new conjugate gradient method for solving nonlinear unconstrained optimization. The new method consists of three parts, the first part of them is the parameter of Hestenes-Stiefel (HS). The proposed method is satisfying the descent condition, sufficient descent condition and ...
A New Coefficient of Conjugate Gradient Method with Global Convergence for Unconstrained Optimization Problems
In this article, we defined a new coefficient formula of the conjugate gradient method for solving non linear unconstrained optimization problems. The new formula β new k is type of line search and the idea of our work is to focus on modification the Perry’s suggestion. We further show that ...